On constraint qualifications in directionally differentiable multiobjective optimization problems
نویسندگان
چکیده
منابع مشابه
On constraint qualifications in directionally differentiable multiobjective optimization problems
We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given in such a way that generalize both the qualifications introduced by Maeda and the classical ones, when the f...
متن کاملNewton-Type Methods for Optimization Problems without Constraint Qualifications
We consider equality-constrained optimization problems, where a given solution may not satisfy any constraint qualification but satisfies the standard second-order sufficient condition for optimality. Based on local identification of the rank of the constraints degeneracy via the singular-value decomposition, we derive a modified primal-dual optimality system whose solution is locally unique, n...
متن کاملInference on Directionally Differentiable Functions
This paper studies an asymptotic framework for conducting inference on parameters of the form φ(θ0), where φ is a known directionally differentiable function and θ0 is estimated by θ̂n. In these settings, the asymptotic distribution of the plug-in estimator φ(θ̂n) can be readily derived employing existing extensions to the Delta method. We show, however, that the “standard” bootstrap is only cons...
متن کاملA Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems
W propose a new approach to convex nonlinear multiobjective optimization that captures the geometry of the Pareto set by generating a discrete set of Pareto points optimally. We show that the problem of finding a maximally uniform representation of the Pareto surface can be formulated as a mathematical program with complementarity constraints. The complementarity constraints arise from modeling...
متن کاملConvex minimization problems with weak constraint qualifications
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak or without constraint qualifications. The main idea is to work with intrinsic topologies which reflect some geom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2004
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2004023